Cost allocation for steiner trees

نویسنده

  • Nimrod Megiddo
چکیده

A se t of points, called consumers, and another point called central supplier, are located i n a Euclidean plane. The cost of constructing a connection between two points i s proportional t o the distance between them. The minimum cost required for connecting a l l the consumers t o the supplier i s given by a minimal Steiner tree. An example i s given i n which for every allocation of the total cost of the tree t o the consumers, a coalition of consumers exists , which i s charged more than the cost required for connecting i t s members t o the central supplier.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on Steiner tree games

We investigate the cost allocation strategy associated with the problem of providing some service of common interest from some source to a number of network users, via the minimum cost directed Steiner tree (ST) network that spans the source and all the receivers. The cost of such ST is distributed among its receivers who may be individuals or organizations with possibly conflicting interests. ...

متن کامل

The Monotonic Cost Allocation Rule in Steiner Tree Network Games

We investigate the cost allocation strategy associated with the problem of providing some network service from source to a number of users, via the Minimum Cost Steiner Tree Network that spans the source and all the receivers. The cost of such a Steiner tree network, is distributed among its receivers. The objective of this paper is to develop a reasonably fair and computationally efficient cos...

متن کامل

Bottleneck Distances and Steiner Trees in the Euclidean d-Space

Some of the most efficient heuristics for the Euclidean Steiner minimal trees in the d-dimensional space, d ≥ 2, use Delaunay tessellations and minimum spanning trees to determine small subsets of geometrically close terminals. Their low-cost Steiner trees are determined and concatenated in a greedy fashion to obtain low cost trees spanning all terminals. The weakness of this approach is that o...

متن کامل

Deep-submicron Rectilinear Steiner Tree Problem

This paper presents a fast polynomial approximation algorithm for constructing the Steiner tree of minimum total cost (the cost of the edge (i; j) equal to the rectilinear distance between these nodes) with diierent requirements on delays along each path to destination. The exibility of the proposed algorithm permits to drive the number of Steiner nodes in the solution without increasing the tr...

متن کامل

Destination-Driven Routing for Low-Cost Multicast

The increasing interest in distributed applications like multimedia and collaborative work calls for e cient means to support multicast communication. A fundamental issue in multicast communication is route selection, usually based on trees. We present a destinationdriven algorithm that optimizes for applications, such as group videoor tele-conferencing, that require multicast trees with low to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Networks

دوره 8  شماره 

صفحات  -

تاریخ انتشار 1978